First-Order Context-Specific Likelihood Weighting in Hybrid Probabilistic Logic Programs

نویسندگان

چکیده

Statistical relational AI and probabilistic logic programming have so far mostly focused on discrete models. The reasons for this is that one needs to provide constructs succinctly model the independencies in such models, also efficient inference.
 Three types of are important represent exploit scalable inference hybrid models: conditional elegantly modeled Bayesian networks, context-specific naturally represented by logical rules, amongst attributes related objects models expressed combining rules.
 This paper introduces a language, DC#, which integrates distributional clauses' syntax semantics principles programs. It represents three qualitatively. More importantly, we introduce algorithm FO-CS-LW DC#. first-order extension likelihood weighting (CS-LW), novel sampling method exploits ground upgrades CS-LW with unification rules case.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Probabilistic Logic Programs as Residuated Logic Programs

In this paper we show the embedding of Hybrid Probabilis-tic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (deenite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the rst time a framework encompassing several qu...

متن کامل

Hybrid Probabilistic Logic Programs as Residuated Logic Programs

In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (deenite) logic programming are validly extrapolated. The importance of this result is that for the rst time a framework encompassing several quite distinct logic programming more general semantical structure paving the way for deen...

متن کامل

Interactive First-Order Probabilistic Logic

Being able to compactly represent large state spaces is crucial in solving a vast majority of practical stochastic planning problems. This requirement is even more stringent in the context of multi-agent systems, in which the world to be modeled also includes the mental state of other agents. This leads to a hierarchy of beliefs that results in a continuous, unbounded set of possible interactiv...

متن کامل

A Tractable First-Order Probabilistic Logic

Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. However, these are intractable, losing the original motivation. Here we propose the first non-trivially tractable first-order probabilistic language. It is a subset of Markov logic, and uses probabilistic class and part hiera...

متن کامل

Monodic Fragments of Probabilistic First-Order Logic

By classical results of Abadi and Halpern, validity for probabilistic first-order logic of type 2 (ProbFO) is Π 1 -complete and thus not recursively enumerable, and even small fragments of ProbFO are undecidable. In temporal first-order logic, which has similar computational properties, these problems have been addressed by imposing monodicity, that is, by allowing temporal operators to be appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 2023

ISSN: ['1076-9757', '1943-5037']

DOI: https://doi.org/10.1613/jair.1.13657